﻿using System;

namespace ProjectEuler
{
    internal class Problem5
    {
        public void Solve()
        {
            const int bigestDivisor = 20;
            var smallestNumber = 0;
            var notfound = true;
            
            while (notfound)
            {
                smallestNumber += bigestDivisor;
                notfound = false;
                for (var i = bigestDivisor; i > 2; i--)
                {
                    if (smallestNumber % i != 0)
                    {
                        notfound = true;
                        break;
                    }
                }
            }

            Console.WriteLine("problem 5: " + smallestNumber);
        }
    }
}